type github.com/andybalholm/brotli.hashComposite

13 uses

	github.com/andybalholm/brotli (current package)
		hash.go#L262: 		return &hashComposite{
		hash.go#L295: 		return &hashComposite{
		hash.go#L300: 		return &hashComposite{
		hash_composite.go#L9: func (h *hashComposite) HashTypeLength() uint {
		hash_composite.go#L19: func (h *hashComposite) StoreLookahead() uint {
		hash_composite.go#L31: type hashComposite struct {
		hash_composite.go#L38: func (h *hashComposite) Initialize(params *encoderParams) {
		hash_composite.go#L46: func (h *hashComposite) Prepare(one_shot bool, input_size uint, data []byte) {
		hash_composite.go#L70: func (h *hashComposite) Store(data []byte, mask uint, ix uint) {
		hash_composite.go#L75: func (h *hashComposite) StoreRange(data []byte, mask uint, ix_start uint, ix_end uint) {
		hash_composite.go#L80: func (h *hashComposite) StitchToPreviousBlock(num_bytes uint, position uint, ringbuffer []byte, ring_buffer_mask uint) {
		hash_composite.go#L85: func (h *hashComposite) PrepareDistanceCache(distance_cache []int) {
		hash_composite.go#L90: func (h *hashComposite) FindLongestMatch(dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, distance_cache []int, cur_ix uint, max_length uint, max_backward uint, gap uint, max_distance uint, out *hasherSearchResult) {